#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <iomanip>
#include <set>
#include <map>
#include <cstdio>
#define fill(a, c) memset(a, c, sizeof(a))
#define ldb long double
#define LL long long
#define nextLine() {int c = 0; while((c = getchar()) != 10 && c != EOF);}
#define sqr(a) ((a) * (a))
#define debug(a) cerr << #a << " = " << a << " ";
#define debugl(a) cerr << #a << " = " << a << "\n";
const ldb eps = 1e-9;
const ldb LDINF = 1e70;
const LL LINF = 1ll << 60;
const int INF = 1 << 30;
const ldb pi = fabs(atan2(0.0, -1.0));
using namespace std;

int n;
class Point
{
	public:
		ldb x, y, z;
		ldb abs() const
		{
			return sqrt(x * x + y * y + z * z);
		}
};

Point operator + (const Point &p1, const Point &p2)
{
	Point p;
	p.x = p1.x + p2.x;
	p.y = p1.y + p2.y;
	p.z = p1.z + p2.z;
	return p;
}

Point operator * (const Point &p1, ldb t)
{
	Point p;
	p.x = p1.x * t;
	p.y = p1.y * t;
	p.z = p1.z * t;
	return p;
}

Point operator - (const Point &p1, const Point &p2)
{
	Point p;
	p.x = p1.x - p2.x;
	p.y = p1.y - p2.y;
	p.z = p1.z - p2.z;
	return p;
}



Point p[10010], P;
ldb vp, vs;


void Load()
{
	cin >> n;
	int i;
	n++;
	for (i = 0; i < n; i++)
	{
		cin >> p[i].x >> p[i].y >> p[i].z;
	}
	cin >> vp >> vs >> P.x >> P.y >> P.z;
}


Point res;
ldb curt;


bool check(ldb t1, ldb t2, int i)
{
	ldb l, r, m1, m2;
	Point q;   
	l = 0;
	r = (t2 - t1);
	for (int j = 0; j <= 300; j++)
	{
		m1 = (l * 2 + r) / 3.0;
		m2 = (l + r * 2) / 3.0;

		q1 = p[i] + (p[i + 1] - p[i]) * (vs * m1 / ((p[i + 1] - p[i]).abs())) - P;
		q2 = p[i] + (p[i + 1] - p[i]) * (vs * m2 / ((p[i + 1] - p[i]).abs())) - P;
		if (q1.abs() > t1)
		if (q.abs() / vp > t1 + mid + eps)
		{
			l = mid;
		}
		else r = mid;
	}
	q = p[i] + (p[i + 1] - p[i]) * (vs * l / ((p[i + 1] - p[i]).abs()));
	q = q - P;
	res = q + P;
	curt = t1 + l;
	if (fabsl(q.abs() / vp - t1 - mid) < eps)
		return true;
	q = p[i] + (p[i + 1] - p[i]) * (vs * (t2 - t1) / ((p[i + 1] - p[i]).abs()));
	q = q - P;
	res = q + P;
	curt = t1 + l;
	if (fabsl(q.abs() / vp - t1 - mid) < eps)
		return true;
		
	return false;
}

void Solve()
{
	int i;
	ldb curdist = 0.0;
	cout << setprecision(10) << fixed;
	for (i = 0; i + 1 < n; i++)
	{
		if (check(curdist / vs, (curdist + (p[i + 1] - p[i]).abs()) / vs, i))
		{
			cout << "YES\n" << curt << "\n" << res.x << " " << res.y << " " << res.z << "\n";
			return;
		}
		curdist += (p[i + 1] - p[i]).abs();
	}
	cout << "NO";
}

int main()
{
#ifndef ONLINE_JUDGE
	freopen("in", "rt", stdin);
	freopen("out", "wt", stdout);
#endif
	Load();
	Solve();
	return 0;
}
